Rank and simulation: the well-founded case

3noWe consider the algorithmic problem of computing the maximal simulation preorder (and quotient) on acyclic labelled graphs. The acyclicity allows to exploit an inner structure on the set of nodes, that can be processed in stages according to a set-theoretic notion of rank. This idea, previously used for bisimulation computation, on the one hand improves on the performances of the ensuing procedure and, on the other hand, gives to the solution an orderly iterative flavour making the algorithmic idea more explicit. The computational complexity achieved is good as we obtain the best performing algorithm for simulation computation on acyclic graphs, in both time and space. © The Author, 2013. Published by Oxford University Press. All rights reserved.partially_openpartially_openGentilini, R.; Piazza, C.; Policriti, A.Gentilini, R.; Piazza, Carla; Policriti, Albert

Aging after shear rejuvenation in a soft glassy colloidal suspension: evidence for two different regimes

The aging dynamics after shear rejuvenation in a glassy, charged clay suspension have been investigated through dynamic light scattering (DLS). Two different aging regimes are observed: one is attained if the sample is rejuvenated before its gelation and one after the rejuvenation of the gelled sample. In the first regime, the application of shear fully rejuvenates the sample, as the system dynamics soon after shear cessation follow the same aging evolution characteristic of normal aging. In the second regime, aging proceeds very fast after shear rejuvenation, and classical DLS cannot be used. An original protocol to measure an ensemble averaged intensity correlation function is proposed and its consistency with classical DLS is verified. The fast aging dynamics of rejuvenated gelled samples exhibit a power law dependence of the slow relaxation time on the waiting time.Comment: 7 pages, 6 figure

Rank-Based Simulation on Acyclic Graphs

The simulation preorder is widely used both as a behavioral relation in concurrent systems, and as an abstraction tool to reduce the state space in model checking, were memory requirement is clearly a critical issue. Therefore, in this context a simulation algorithm should address both time and space efficiency. In this paper, we rely on the notion of rank to design an efficient simulation algorithm. It turns out that such algorithm outperforms-both in terms of time and in terms of space-the best simulation algorithms in the literature, on the class of acyclic graphs

Biomonitoring of metals in children living in an urban area and close to waste incinerators

The impact of waste incinerators is usually examined by measuring environmental pollutants. Biomonitoring has been limited, until now, to few metals and to adults. We explored accumulation of a comprehensive panel of metals in children free-living in an urban area hosting two waste incinerators. Children were divided by georeferentiation in exposed and control groups, and toenail concentrations of 23 metals were thereafter assessed. The percentage of children having toenail metal concentrations above the limit of detection was higher in exposed children than in controls for Al, Ba, Mn, Cu, and V. Exposed children had higher absolute concentrations of Ba, Mn, Cu, and V, as compared with those living in the reference area. The Tobit regression identified living in the exposed area as a significant predictor of Ba, Ni, Cu, Mn, and V concentrations, after adjusting for covariates. The concentrations of Ba, Mn, Ni, and Cu correlated with each other, suggesting a possible common source of emission. Exposure to emissions derived from waste incinerators in an urban setting can lead to body accumulation of specific metals in children. Toenail metal concentration should be considered a noninvasive and adequate biomonitoring tool and an early warning indicator which should integrate the environmental monitoring of pollutants

An Algorithm for Probabilistic Alternating Simulation

In probabilistic game structures, probabilistic alternating simulation (PA-simulation) relations preserve formulas defined in probabilistic alternating-time temporal logic with respect to the behaviour of a subset of players. We propose a partition based algorithm for computing the largest PA-simulation, which is to our knowledge the first such algorithm that works in polynomial time, by extending the generalised coarsest partition problem (GCPP) in a game-based setting with mixed strategies. The algorithm has higher complexities than those in the literature for non-probabilistic simulation and probabilistic simulation without mixed actions, but slightly improves the existing result for computing probabilistic simulation with respect to mixed actions.Comment: We've fixed a problem in the SOFSEM'12 conference versio

OBDD-Based Representation of Interval Graphs

A graph $G = (V,E)$ can be described by the characteristic function of the edge set $\chi_E$ which maps a pair of binary encoded nodes to 1 iff the nodes are adjacent. Using \emph{Ordered Binary Decision Diagrams} (OBDDs) to store $\chi_E$ can lead to a (hopefully) compact representation. Given the OBDD as an input, symbolic/implicit OBDD-based graph algorithms can solve optimization problems by mainly using functional operations, e.g. quantification or binary synthesis. While the OBDD representation size can not be small in general, it can be provable small for special graph classes and then also lead to fast algorithms. In this paper, we show that the OBDD size of unit interval graphs is $O(\ | V \ | /\log \ | V \ |)$ and the OBDD size of interval graphs is $O(\ | V \ | \log \ | V \ |)$which both improve a known result from Nunkesser and Woelfel (2009). Furthermore, we can show that using our variable order and node labeling for interval graphs the worst-case OBDD size is$\Omega(\ | V \ | \log \ | V \ |)$. We use the structure of the adjacency matrices to prove these bounds. This method may be of independent interest and can be applied to other graph classes. We also develop a maximum matching algorithm on unit interval graphs using$O(\log \ | V \ |)$operations and a coloring algorithm for unit and general intervals graphs using$O(\log^2 \ | V \ |)$ operations and evaluate the algorithms empirically.Comment: 29 pages, accepted for 39th International Workshop on Graph-Theoretic Concepts 201

Characterization of FRCM- and FRP-Masonry Bond Behavior

Composites made of fibers embedded in organic or inorganic matrices are efficient systems for reinforcing historical masonry structures to provide strength and ductility with a negligible mass increment. As it is well known, the structural performance of the composites mainly relies on their adhesion to the substrate. There are different methods to test the adhesion of the composite to the substrate: in laboratory direct shear test is the most commonly employed, while on-site the bond between the reinforcement and the substrate is checked by the pull-off test. In this paper, the adhesion of different composites to the same substrate made of fired-clay bricks is investigated by both the shear test and the pull-off test to qualitatively assess the difference in the two methods. Additionally, to investigate whether the bond is affected by the presence of water in the pores, half of the specimens were tested in water saturated conditions. Three different types of matrix (based on epoxy resin, natural hydraulic lime and Portland cement) were used for the composite matrix, without changing the geometry, the type of masonry substrate and the fibers (galvanized steel cords)